#define _USE_MATH_DEFINES

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <cassert>
#include <stack>
#include <cstdlib>
#include <bitset>
#include <cmath>

#define forn(i,n) for (int i = 0; i < int(n); ++i)
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) int(a.size())
#define mp make_pair

using namespace std;

typedef long long li;
typedef long double ld;

typedef pair<int,int> pt;
#define ft first
#define sc second

const int INF = int(1e9);
const li INF64 = li(1e18);
const ld EPS = 1e-9;

//#define TASK_NAME ""

int n;
const int N = 55;
int d[N][N];

bool read() {
	if (!(cin >> n))
		return false;
	
	forn (i, n)
		forn (j, n)
			cin >> d[i][j];

	return true;
}

vector<pair<int, int> > g[N];

int T, used[N];
int a[N];

void dfs(int v)
{
	used[v] = T;
	forn (i, g[v].size())
	{
		int to = g[v][i].ft;
		if (used[to] == T)
			continue;
		a[to] = min(a[v], g[v][i].sc);
		dfs(to);
	}
}

void solve() {

	vector<int> order(n);

	forn (i, n)
		order[i] = i;

	forn (it, 1000)
	{
		random_shuffle(all(order));

		forn (i, N)
			g[i].clear();

		forn (i, sz(order) - 1)
		{
			g[order[i]].pb(mp(order[i + 1], d[order[i]][order[i + 1]]));
			g[order[i + 1]].pb(mp(order[i], d[order[i]][order[i + 1]]));
		}

		bool bad = false;

		forn (i, n)
		{
			a[i] = INF;
			T++;
			dfs(i);
			a[i] = 0;
			forn (j, n)
				if (a[j] != d[i][j])
					bad = true;
		}

		if (!bad)
		{
			cout << "YES" << endl;
			cout << n - 1 << endl;
			forn (i, n - 1)
				cout << order[i] + 1 << ' ' << order[i + 1] + 1 << ' ' << d[order[i]][order[i + 1]] << endl;
			return;
		}
	}
	cout << "NO" << endl;
}

int main() {
#ifdef TASK_NAME
	freopen(TASK_NAME ".in", "r", stdin);
	freopen(TASK_NAME ".out", "w", stdout);
#endif

#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
#endif

	while (read())
		solve();

	return 0;
}